Mining Simple Path Traversal Patterns in Knowledge Graph

The data mining has remained a subject of unfailing charm for research. knowledge graph is rising and showing infinite life force strong developing potential in recent years, where it observed that acyclic capacity enhancing usability. Though the development graphs provided an ample scope appearing abilities mining, related researches are still insufficient. In this paper, we introduce path traversal patterns to graph. We design novel simple pattern framework improving representativeness result. A divide-and-conquer approach combining each proposed discover most frequent To support algorithm, linked list structure indexed by length sequences with handy operations. correctness algorithm proven. Experiments show our reaches high coverage low output amounts compared existing sequence algorithms.